Argumentative explanations for pattern-based text classifiers
نویسندگان
چکیده
Recent works in Explainable AI mostly address the transparency issue of black-box models or create explanations for any kind (i.e., they are model-agnostic), while leaving interpretable largely underexplored. In this paper, we fill gap by focusing on a specific model, namely pattern-based logistic regression (PLR) binary text classification. We do so because, albeit interpretable, PLR is challenging when it comes to explanations. particular, found that standard way extract from model does not consider relations among features, making hardly plausible humans. Hence, propose AXPLR, novel explanation method using (forms of) computational argumentation generate (for outputs computed PLR) which unearth agreements and disagreements features. Specifically, use as follows: see features (patterns) arguments form quantified bipolar frameworks (QBAFs) attacks supports between based specificity arguments; understand gradual semantics these QBAFs, used determine arguments’ dialectic strength; study properties QBAFs context our argumentative re-interpretation PLR, sanctioning its suitability explanatory purposes. then show how intuitive constructed QBAFs. Finally, conduct an empirical evaluation two experiments human-AI collaboration demonstrate advantages resulting AXPLR method.
منابع مشابه
Classifiers for Dissimilarity-Based Pattern Recognition
In the traditional way of learning from examples of objects the classifiers are built in a feature space. However, alternative ways can be found by constructing decision rules on dissimilarity (distance) representations, instead. In such a recognition process a new object is described by its distances to (a subset of) the training samples. In this paper a number of methods to tackle this type o...
متن کاملText Classifiers for Political Ideologies
Machine learning techniques have become very popular for a number of text classification tasks, from spam filters to sentiment analysis to topic classification. In this paper, we will apply a number of machine learning techniques to classifying text by the political ideology of the speaker (i.e. Republican or Democrat). This is a potentially useful application of text classification, as when re...
متن کاملCombining homogeneous classifiers for centroid-based text classification
Centroid-based text classification is one of the most popular supervised approaches to classify texts into a set of pre-defined classes. Based on the vector-space model, the performance of this classification particularly depends on the way to weight and select important terms in documents for constructing a prototype class vector for each class. In the past, it was shown that term weighting us...
متن کاملParaphrasing and Aggregating Argumentative Text Using Text Structure
We argue in this paper that sophisticated mi-croplanning techniques are required even for mathematical proofs, in contrast to the belief that mathematical texts are only schematic and mechanical. We demonstrate why paraphrasing and aggregation signiicantly enhance the exibility and the coherence of the text produced. To this end, we adopted the Text Structure of Meteer as our basic representati...
متن کاملCorpus based coreference resolution for Farsi text
"Coreference resolution" or "finding all expressions that refer to the same entity" in a text, is one of the important requirements in natural language processing. Two words are coreference when both refer to a single entity in the text or the real world. So the main task of coreference resolution systems is to identify terms that refer to a unique entity. A coreference resolution tool could be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Argument & Computation
سال: 2023
ISSN: ['1946-2174', '1946-2166']
DOI: https://doi.org/10.3233/aac-220004